Rast: A Language for Resource-Aware Session Types

Traditional session types prescribe bidirectional communication protocols for concurrent computations, where well-typed programs are guaranteed to adhere the protocols. However, simple cannot capture properties beyond basic type of exchanged messages. In response, recent work has extended with refinements from linear arithmetic, capturing intrinsic attributes processes and data. These then play a central role in describing sequential parallel complexity bounds on session-typed programs. The Rast language provides an open-source implementation arithmetic as well ergometric temporal span program execution. To further support generic programming, also enhances arithmetically refined recently developed nested parametric polymorphism. Type checking relies Cooper's algorithm quantifier elimination Presburger few significant optimizations, heuristic extension nonlinear constraints. furthermore includes reconstruction engine so that most constructs pertaining layers resources inserted automatically. We provide variety examples demonstrate expressivity language.